github.com/andybalholm/brotli.zopfliNode.u (field)

17 uses

	github.com/andybalholm/brotli (current package)
		backward_references_hq.go#L9: 	u                   struct {
		backward_references_hq.go#L30: 	stub.u.cost = kInfinity
		backward_references_hq.go#L231: 	next.u.cost = cost
		backward_references_hq.go#L289: 	for pos+len <= num_bytes && nodes[pos+len].u.cost <= min_cost {
		backward_references_hq.go#L325: 		return nodes[pos-clen-ilen].u.shortcut
		backward_references_hq.go#L338: 	var p uint = uint(nodes[pos].u.shortcut)
		backward_references_hq.go#L347: 		p = uint(nodes[p-clen-ilen].u.shortcut)
		backward_references_hq.go#L360: 	var node_cost float32 = nodes[pos].u.cost
		backward_references_hq.go#L361: 	nodes[pos].u.shortcut = computeDistanceShortcut(block_start, pos, max_backward_limit, gap, nodes)
		backward_references_hq.go#L447: 					if cost < nodes[pos+l].u.cost {
		backward_references_hq.go#L502: 					if cost < nodes[pos+len].u.cost {
		backward_references_hq.go#L522: 	nodes[index].u.next = math.MaxUint32
		backward_references_hq.go#L526: 		nodes[index].u.next = uint32(len)
		backward_references_hq.go#L537: 	var offset uint32 = nodes[0].u.next
		backward_references_hq.go#L545: 		offset = next.u.next
		backward_references_hq.go#L580: 	nodes[0].u.cost = 0
		backward_references_hq.go#L640: 	nodes[0].u.cost = 0